Bounded and unbounded behavior for area-preserving rational pseudo-rotations
نویسندگان
چکیده
منابع مشابه
On Bounded Boundary and Bounded Radius Rotations
K. I. Noor, W. Ul-Haq, M. Arif, and S. Mustafa Department of Mathematics, COMSATS Institute of Information Technology, 44000 Islamabad, Pakistan Correspondence should be addressed to M. Arif, [email protected] Received 6 January 2009; Revised 6 March 2009; Accepted 19 March 2009 Recommended by Narendra Kumar Govil We establish a relation between the functions of bounded boundary and bounded ...
متن کاملThe neural basis of bounded rational behavior
Bounded rational behaviour is commonly observed in experimental games and in real life situations. Neuroeconomics can help to understand the mental processing underlying bounded rationality and out-of-equilibrium behaviour. Here we report results from recent studies on the neural basis of limited steps of reasoning in a competitive setting – the beauty contest game. We use functional magnetic r...
متن کاملRational quadratic - flux minimizing circles for area - preserving twist maps
By considering families of periodic pseudo-orbits on the cylindrical phase space of an area-preserving twist map, we construct curves of rational rotation number that are critical points of a non-negative error norm (the mean-square action gradient or "quadratic flux"). Two alternative angle-parametrizations of the curves are presented and numerical evidence is given that the curves possess the...
متن کاملBounded Domains and Unbounded Domains
First, notions of inside components and outside components are introduced for any subset of n-dimensional Euclid space. Next, notions of the bounded domain and the unbounded domain are defined using the above components. If the dimension is larger than 1, and if a subset is bounded, a unbounded domain of the subset coincides with an outside component (which is unique) of the subset. For a spher...
متن کاملA Non-trigonometric, Pseudo Area Preserving, Polyline Smoothing Algorithm
A line-smoothing algorithm based on simple arithmetic is presented and its characteristics are analyzed for various implementations. The algorithm is efficient because it can be implemented using only simple integer arithmetic, with no square root or trigonometric calculations. The algorithm is applicable to graph drawing applications that require smooth polylines between graph nodes. Though th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the London Mathematical Society
سال: 2014
ISSN: 0024-6115
DOI: 10.1112/plms/pdu023